Dynamical Methods for Polar Decomposition and Inversion of Matrices
نویسندگان
چکیده
We show how one may obtain polar decomposition as well as inversion of xed and time-varying matrices using a class of nonlinear continuous-time dynamical systems. First we construct a dynamic system that causes an initial approximation of the inverse of a time-varying matrix to ow exponentially toward the true time-varying inverse. Using a time-parameterized homotopy from the identity matrix to a xed matrix with unknown inverse, and applying our result on the inversion of time-varying matrices, we show how any positive de nite xed matrix may be dynamically inverted by a prescribed time without an initial guess at the inverse. We then construct a dynamical system that solves for the polar decomposition factors of a time-varying matrix given an initial approximation for the inverse of the positive de nite symmetric part of the polar decomposition. As a byproduct, this method gives another method of inverting time-varying matrices. Finally, using homotopy again, we show how dynamic polar decomposition may be applied to xed matrices with the added bene t that this allows us to dynamically invert any xed matrix by a prescribed time.
منابع مشابه
Symbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملParallel Singular Value Decomposition via the Polar Decomposition
A new method is described for computing the singular value decomposition (SVD). It begins by computing the polar decomposition and then computes the spectral decomposition of the Hermitian polar factor. The method is particularly attractive for shared memory parallel computers with a relatively small number of processors, because the polar decomposition can be computed efficiently on such machi...
متن کاملJ-Orthogonal Matrices: Properties and Generation
A real, square matrix Q is J-orthogonal if Q JQ = J , where the signature matrix J = diag(±1). J-orthogonal matrices arise in the analysis and numerical solution of various matrix problems involving indefinite inner products, including, in particular, the downdating of Cholesky factorizations. We present techniques and tools useful in the analysis, application and construction of these matrices...
متن کاملFinding the polar decomposition of a matrix by an efficient iterative method
Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.
متن کاملDYNAMIC INVERSION AND POLAR DECOMPOSITION OF MATRICES - Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
Usznq the recently zntroduced concept of a "dynamzc znverse" of a map, along wzth zts assoczated analog compvtatzonal pnradzgm. we construct contznuous-tame iionlzneor dynamzcal systems whzch produce both regulor and generalazed znverses of ttme-varyzng and $xed matrzccs, as well as polar decomposataons.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000